Hardness of approximation

#	Item
21	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 09:39:33 Computational complexity theory NP-complete problems Probabilistic complexity theory PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof NP Clique Theoretical computer science Applied mathematics Mathematics
22	Curriculum Vitae Venkatesan Guruswami Webpage: www.cs.cmu.edu/~ venkatg Email: [removed] Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-11-15 13:27:20 Applied mathematics Mathematics Computational complexity theory Information theory List decoding Venkatesan Guruswami ACM SIGACT Computer science Hardness of approximation Error detection and correction Theoretical computer science Coding theory
23	Probabilistic Checking of Proofs and Hardness of Approximation Problems Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2005-03-10 11:31:01 Probabilistic complexity theory Mathematical optimization Probabilistically checkable proof Sanjeev Arora PCP theorem Complexity classes MAX-3SAT Hardness of approximation NP Theoretical computer science Applied mathematics Computational complexity theory